Competitive analysis of online real-time scheduling algorithms under hard energy constraint
نویسندگان
چکیده
منابع مشابه
Hybrid Online/ooine Scheduling for Hard Real-time Systems
OOine (cyclic executive) and online preemptive, priority-based scheduling are not exclusive options but rather complementary techniques that can be combined to improve analytically veriiable schedulability. Selective ooine scheduling of periodic tasks improves online schedula-bility based on rate-monotonic priority assignment. Relative to pure ooine scheduling, a hybrid approach has the advanta...
متن کاملOnline Hard Real-Time Scheduling for Hypercube Multiprocessors
Scheduling sporadic tasks is a formidable problem in hard real-time systems, particularly multiprocessor systems. Until now little research has addressed this problem for hypercube multiprocessors. In this paper we study two online scheduling algorithms-Buddy/RT and Stacking, for hard real-time environments which provide guarantees at the time of arrival of a task. Buddy/RT is a straightforward...
متن کامل- 1 - Focusing on Some ( Hard ) Real - Time Scheduling Algorithms
Hard Real-Time systems are becoming more and more popular in sophisticated applications such as flight control, automated manufacturin plants, controllers of robots, etc. Because of the strict timing constraints such systems must have a high predictability of their timing behaviour. Th requires specific scheduling algorithms able to make the requirement consistent with all other characteristics...
متن کاملCompetitive algorithms for multistage online scheduling
We study an online flow shop scheduling problem where each job consists of several tasks that have to be completed in t different stages and the goal is to maximize the total weight of accepted jobs. The set of tasks of a job contains one task for each stage and each stage has a dedicated set of identical parallel machines corresponding to it that can only process tasks of this stage. In order ...
متن کاملEnergy Aware EDF Scheduling in Distributed Hard Real Time Systems
We present an energy aware scheduling algorithm for distributed hard real time systems with end-to-end deadlines. The approach is focused on the general scenario where the end-to-end deadline is not distributed among the tasks in the chain of precedence. The energy saving is obtained by applying DVS to the dynamic scheduling. The complexity of energy saving algorithm in this scenario mainly rel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Real-Time Systems
سال: 2010
ISSN: 0922-6443,1573-1383
DOI: 10.1007/s11241-010-9100-y